package com.leetcode.algorithm.common;

public class TreeNodeExt {
    public int val;
    public int i1;
    public int i2;
    public TreeNodeExt left;
    public TreeNodeExt right;

    public TreeNodeExt(int val) {
        this.val = val;
    }

    public TreeNodeExt(int val, int i1) {
        super();
        this.val = val;
        this.i1 = i1;
    }

    public TreeNodeExt(int val, int i1, int i2) {
        super();
        this.val = val;
        this.i1 = i1;
        this.i2 = i2;
    }

    public TreeNodeExt(TreeNode tree) {
        this.val = tree.val;
        if (tree.left != null) {
            this.left = new TreeNodeExt(tree.left);
        }
        if (tree.right != null) {
            this.right = new TreeNodeExt(tree.right);
        }
    }
}